On finding minimal length superstrings
نویسندگان
چکیده
منابع مشابه
Finding Minimal Length Representatives in Thompson’s Group F
Cleary and Taback devised a method called the nested traversal method to construct minimal length representatives for positive and negative elements in Thomspson’s group. We show how to use the nested traversal method to construct minimal length representatives for a larger class of elements of this
متن کاملOn Finding Minimal w-cutset
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subset of variables yields a subproblem of the reduced complexity where instantiated variables are removed. If the assigned variables constitute a cycle-cutset, the rest of the network is singly-connected and therefore can...
متن کاملOn finding minimal w-cutset problem
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that conditioning (assigning values) on a subset of variables yields a subproblem of the reduced complexity where instantiated variables are removed. If the assigned variables constitute a cycle-cutset, the rest of the network is singly-connected and therefore can be ...
متن کاملOn Finding Minimal Two-Connected Subgraphs
Wepresent e cient parallel algorithms for the problems of nding a minimal2-edge-connected spanning subgraph of a 2-edge-connected graph and nding a minimalbiconnected spanning subgraph of a biconnected graph. The parallel algorithms run in polylog time using a linear number of PRAM processors. We also give linear time sequential algorithms for minimally augmenting a spanning tree into a 2-edge-...
متن کاملAlgorithms and Experiments on Finding Minimal Models
In this paper we consider the problem of finding minimal models of a set of propositional clauses. This problem has many applications: for instance, finding minimal-length plans, minimal diagnosis, and solving many other minimization and maximization problems. We have adapted the Davis-Putnam algorithm (that finds generic models of a set of clauses) in order to find minimal models. Experiments ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1980
ISSN: 0022-0000
DOI: 10.1016/0022-0000(80)90004-5